Conflict-free AGV Routing in a Bi-directional Path Layout
نویسنده
چکیده
AGV systems are now becoming widely used in automatic material handling systems. One of the issues arising in applications is routing. This paper presents a bi-directional path layout and an algorithm for routing AGVs without conflicts. Mathematical relationships among certain key parameters of path and vehicle are derived to minimize the space requirements of the layout. The routing efficiency is analyzed in terms of the distance traveled and the time required by AGVs to complete all pickup and drop-off jobs. Results of this study could form a basic for other more complicated AGV path layouts and routing algorithms.
منابع مشابه
Two optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملSequence Based Hierarchical Conflict-free Routing Strategy
Conflict-free routing is an important problem to be addressed in AGV Systems, in particular when they are bi-directional. This paper considers the problem of routing AGVs in the presence of contingencies. The importance of this work stems from the realization that path-planning approaches are ill suited to AGVSs subject to contingencies. In this paper, a two stage closed-loop control strategy i...
متن کاملAn Extended Fault-Tolerant Link-State Routing Protocol in the Internet
Link state routing protocols such as OSPF and IS IS are widely used in the Internet today In link state routing protocols global network topology information is rst collected at each node A shortest path tree SPT is then constructed by applying the Dijkstra s shortest path algorithm at each node Link state protocols usually require the ooding of new information to the entire sub network after c...
متن کاملAn Extended Fault - Tolerant Link - State Routing Protocol in the Internet 1
Link-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet today. In link-state routing protocols, global network topology information is first collected at each node. A shortest path tree (SPT) is then constructed by applying the Dijkstra’s shortest path algorithm at each node. Link-state protocols usually require the flooding of new information to the entire (sub)ne...
متن کاملConflict-free Real-time AGV Routing
We present an algorithm for the problem of routing Automated Guided Vehicles (AGVs) in an automated logistic system. The algorithm avoids collisions, deadlocks and livelocks already at the time of route computation (conflict-free routing). After a preprocessing step the real-time computation for each request consists of the determination of a shortest path with time-windows and a following read...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007